Search results for "design [accelerator]"

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks

2016

Abstract This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loaded and is operated in a last-in-first-out (LIFO) fashion, meaning that when an item is picked up, it is positioned at the rear of a stack. An item can only be delivered if it is in that position. This problem arises in the transportation of heavy or dangerous material where unnecessary handling should be avoided, such as in the transportation of cars between car dealers and the transportation of livestock from farms to slaughterhouses. To solve this problem, we propose two different branch-price-and-cut algorithms. The first sol…

The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints

2019

In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are beneficial to the transport company, several visits may be undesirable on the customer side: At each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, we investigate two different types of measures for limiting customer inconvenience (a m…

The directed profitable rural postman problem with incompatibility constraints

2017

[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving them. If convenient, some of the incompatibilities can be removed provided that penalties are paid. The problem looks for a tour starting and ending at the depot that maximizes the difference between collected profits and total cost as sum of traveling costs and paid penalties, while satisfying remaining incompatibilities. The problem finds application in the domain of road transportation service, and in particular in the context of horizontal collaboration among carriers …

The periodic rural postman problem with irregular services on mixed graphs

2019

Abstract In this paper, we deal with an extension of the rural postman problem in which some links of a mixed graph must be traversed a given number of times over a time horizon. These links represent entities that must be serviced a specified number of times in some subsets of days (or periods) of the time horizon. The aim is to design a set of minimum-cost tours, one for each day/period of the time horizon, that satisfy the service requirements. We refer to this problem as the periodic rural postman problem with irregular services (PRPP–IS). Some practical applications of the problem can be found in road maintenance operations and road network surveillance, for example. In order to solve …

Problem Space Identification for Developing Virtual Reality Learning Environments

2021

Our study argues that the extant literature on virtual reality-based learning environments (VRLEs) currently lacks proper definitions and context descriptions for a problem space, which is fundamental for conducting design science research (DSR). Without properly conducted problem space identification, the most pivotal problems cannot be identified resulting solutions lacking validity and unreliable evaluations. This is a major challenge for the DSR in the educational field, but also for the research on VRLEs. The purpose of this paper is to introduce a novel DSR method to support rigorous problem space identification, which would allow rigorous and profound problem space analysis. The inst…

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

2017

[EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distan…

Strategies to gain novel Alzheimer’s disease diagnostics and therapeutics using modulators of ABCA transporters

2021

Adenosine-triphosphate-(ATP)-binding cassette (ABC) transport proteins are ubiquitously present membrane-bound efflux pumps that distribute endo- and xenobiotics across intra- and intercellular barriers. Discovered over 40 years ago, ABC transporters have been identified as key players in various human diseases, such as multidrug-resistant cancer and atherosclerosis, but also neurodegenerative diseases, such as Alzheimer���s disease (AD). Most prominent and well-studied are ABCB1, ABCC1, and ABCG2, not only due to their contribution to the multidrug resistance (MDR) phenotype in cancer, but also due to their contribution to AD. However, our understanding of other ABC transporters is limited…

Binding mode analysis of ABCA7 for the prediction of novel Alzheimer's disease therapeutics

2021

Graphical abstract

Quasi-linear time computation of the abelian periods of a word

2012

Computing abelian periods in words

2011

International audience